Linear diophantine equations for discrete tomography
نویسندگان
چکیده
In this report, we present a number-theory-based approach for discrete tomography (DT),which is based on parallel projections of rational slopes. Using a well-controlled geometry of X-ray beams, we obtain a system of linear equations with integer coefficients. Assuming that the range of pixel values is a(i, j) = 0, 1, . . . , M − 1, with M being a prime number, we reduce the equations modulo M . To invert the linear system, each algorithmic step only needs log22 M bit operations. In the case of a small M , we have a greatly reduced computational complexity, relative to the conventional DT algorithms, which require log22 N bit operations for a real number solution with a precision of 1/N . We also report computer simulation results to support our analytic conclusions.
منابع مشابه
Multivariate Discrete Splines and Linear Diophantine Equations
In this paper we investigate the algebraic properties of multivariate discrete splines. It turns out that multivariate discrete splines are closely related to linear diophantine equations. In particular, we use a solvability condition for a system of linear diophantine equations to obtain a necessary and sufficient condition for the integer translates of a discrete box spline to be linearly ind...
متن کاملDiophantine Equations Related with Linear Binary Recurrences
In this paper we find all solutions of four kinds of the Diophantine equations begin{equation*} ~x^{2}pm V_{t}xy-y^{2}pm x=0text{ and}~x^{2}pm V_{t}xy-y^{2}pm y=0, end{equation*}% for an odd number $t$, and, begin{equation*} ~x^{2}pm V_{t}xy+y^{2}-x=0text{ and}text{ }x^{2}pm V_{t}xy+y^{2}-y=0, end{equation*}% for an even number $t$, where $V_{n}$ is a generalized Lucas number. This pape...
متن کاملSparse Solutions of Linear Diophantine Equations
We present structural results on solutions to the Diophantine system Ay = b, y ∈ Z ≥0 with the smallest number of non-zero entries. Our tools are algebraic and number theoretic in nature and include Siegel’s Lemma, generating functions, and commutative algebra. These results have some interesting consequences in discrete optimization.
متن کاملDiscrete Truncated Powers And Lattice Points In Rational Polytope ∗
Discrete truncate power is very useful for studying the number of nonnegative integer solutions of linear Diophantine equations. In this paper, some detail information about discrete truncated power is presented. To study the number of integer solutions of linear Diophantine inequations, the generalized truncated power and generalized discrete truncated power are defined and discussed respectiv...
متن کاملPresentations of finitely generated cancellative commutative monoids and nonnegative solutions of systems of linear equations
Varying methods exist for computing a presentation of a finitely generated commutative cancellative monoid.We use an algorithm of Contejean andDevie [An efficient incremental algorithm for solving systems of linear diophantine equations, Inform. andComput. 113 (1994) 143–172] to show how these presentations can be obtained from the nonnegative integer solutions to a linear system of equations. ...
متن کامل